Graphical temporal graph pattern editor

ABSTRACT

An interactive display system enables a user to compose a graph pattern for a temporal graph on a display screen. The system comprises a canvas that provides an interactive editing surface. The editor receives an input a set of user interactions, such as the drawing of lines and boxes, the specifying of attributes, and the like, that together compose a graph pattern. During the graph pattern composition, the user may retrieve other graph patterns (e.g., from a data store) and integrate them into the pattern being composed. Once the graph pattern is composed (or as it is being composed), the system converts the graphical pattern into a text-based representation, such as a computer program in a particular graph programming language, which is then used for subsequent processing and matching in a cybersecurity threat discovery workflow. The pattern (program code) also is stored to disk, from which it may be retrieved and converted back into its graphical view on the screen, e.g., for further editing and revision.

STATEMENT REGARDING SPONSORED RESEARCH

This invention was made with government support under Contract FA8650-15-C-7561 awarded by the Defense Advanced Research Projects Agency (DARPA). The government has certain rights in the invention.

BACKGROUND Technical Field

This disclosure relates generally to computer network and system security and, in particular, to techniques for characterizing and discriminating user behavior.

Background of the Related Art

Causality reasoning is an important task in cybersecurity threat intelligence and investigation. Given an indicator of compromise (IOC), a Security Operation Center (SOC) analyst needs to find out what if any earlier signs of the compromise exist, what led to the compromise (including the root cause), and what are the consequences of the compromise (extent and impact). Causality reasoning helps analysts to rule out false positives in IOCs, to discover large attack campaigns, and to assess their impact. Today, SOC analysts regularly perform such investigation manually, typically supported by spreadsheets and notes on paper. Such reasoning requires extensive manual work, e.g., pulling data from different sources, connecting that data in graphs, and determining the causal chain and consequences of IOCs. These known techniques rely heavily on the intuition and experience of the analysts to reproduce well-formatted causal chains, and not to miss important elements. More recently, graph-based automation has been applied in causality tracking. In these automated approaches, threat discovery is transformed into a graph computation problem. In particular, security logs, traces, and alerts are stored in a temporal graph (computation) derived from system-generated events. The graph records the history of monitored systems, including benign activities and malicious ones, as interconnected entities and events. Threat discovery then becomes a graph computation problem to identify a subgraph therein that describes a threat or an attack, preferably with the help of alerts and security domain knowledge stored as element labels.

Graph pattern matching is an important aspect of graph analytic problems, such as graph-based search and fraud detection. In cybersecurity, and as noted above, one can model all computation (e.g., network activities, program behaviors, file creation/deletion) as temporal graphs and conduct threat detection as graph pattern matching problems. An important aspect of this workflow is how to efficiently compose graph patterns for temporal graphs. Straightforwardly, one can describe graph patterns in graph programming languages, e.g., Neo4J, which requires lots of training, especially for non-programmers. There remains a need to provide alternatives that can be used intuitively, e.g., by non-programmers, to enable composition of graph patterns for temporal graphs.

BRIEF SUMMARY

According to this disclosure, an interactive display system enables a user to compose (visualize/draw) a graph pattern for a temporal graph on a display screen. The system comprises a canvas that provides an interactive editing surface. The editor receives an input a set of user interactions, such as the drawing of lines and boxes, the specifying of attributes, and the like, that together compose a graph pattern. During the graph pattern composition, the user may retrieve other graph patterns (e.g., from a data store) and integrate them into the pattern being composed. Once the graph pattern is composed (or as it is being composed), the system converts the graphical pattern into a text-based representation, such as a computer program in a particular graph programming language, which is then used for subsequent processing and matching in a cybersecurity threat discovery workflow. The pattern (program code) also is stored to disk, from which it may be retrieved and converted back into its graphical view on the screen, e.g., for further editing and revision.

Preferably, the editor implements a grid-like visual interface that enables the user to visually encode temporal information in the pattern. The editor provides an easy-to-use and intuitive interface by which human knowledge on a threat is received and readily encoded to generate a graph pattern. Graph patterns created in the manner comprise a pattern library, and patterns so composed are reusable. In this manner, the editor enables the human knowledge on threats to be converted into the structured knowledge in the graph pattern library. The editor facilitates temporal pattern encoding but without requiring the user to be a programmer or have other specialized knowledge for generating the structured knowledge.

The foregoing has outlined some of the more pertinent features of the subject matter. These features should be construed to be merely illustrative. Many other beneficial results can be attained by applying the disclosed subject matter in a different manner or by modifying the subject matter as will be described.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the disclosed subject matter and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:

FIG. 1 depicts an exemplary block diagram of a distributed data processing environment in which exemplary aspects of the illustrative embodiments may be implemented;

FIG. 2 is an exemplary block diagram of a data processing system in which exemplary aspects of the illustrative embodiments may be implemented;

FIG. 3 illustrates a security intelligence platform in which the techniques of this disclosure may be practiced;

FIG. 4 depicts an Advanced Persistent Threat (APT) platform in which the techniques of this disclosure may be practiced;

FIG. 5 illustrates an operating environment in which a cognitive cybersecurity intelligence center is used to manage an endpoint machine and in which the techniques of this disclosure may be implemented;

FIG. 6 depicts a representative malicious behavior graph abstraction, and several inter-process activity graphs that are matched to the graph abstraction;

FIG. 7 depicts a representative inter-process graph constructed by monitoring activities among entities in an endpoint, and how various matching techniques are executed against that graph by an endpoint protection system according to the techniques herein;

FIG. 8 depicts an implementation of an endpoint inter-process activity extraction and pattern matching system;

FIG. 9 depicts a system stack on top of which the techniques of this disclosure may be implemented;

FIG. 10 depicts an interactive display system graph pattern editor according to an embodiment of this disclosure;

FIG. 11 depicts how the editor in FIG. 10 is used for graph pattern composition;

FIG. 12 depicts a representative pattern graph composed for host level activities using the graph editor;

FIG. 13 depicts a representative pattern graph composed for a set of network level activities using the graph editor;

FIG. 14 depicts a representative activity graph composed for a set of process level activities using the graph editor;

FIG. 15 depicts an example interface description showing how a user specifies a single-entity pattern using the editor;

FIG. 16 depicts an example interface description showing how a user specifies a process and various entities that interact with that process;

FIG. 17 depicts an example interface description showing how a user specifies a multi-hop relation using the editor; and

FIG. 18 depicts an example interface description showing how a user specifies a pattern argument on the pattern graph.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

As will be described below, the techniques herein utilize machine learning to derive semantic models of system events for use to provide behavior-based malware detection. Typically, machine learning algorithms and associated mechanisms execute as software, e.g., one or more computer programs, executing in one or more computing machines. As background, the following describes representative computing machines and systems that may be utilized for executing the learning process and using the derived system event model. Several execution environments (FIGS. 3-5) are also described.

With reference now to the drawings and in particular with reference to FIGS. 1-2, exemplary diagrams of data processing environments are provided in which illustrative embodiments of the disclosure may be implemented. It should be appreciated that FIGS. 1-2 are only exemplary and are not intended to assert or imply any limitation with regard to the environments in which aspects or embodiments of the disclosed subject matter may be implemented. Many modifications to the depicted environments may be made without departing from the spirit and scope of the present invention.

With reference now to the drawings, FIG. 1 depicts a pictorial representation of an exemplary distributed data processing system in which aspects of the illustrative embodiments may be implemented. Distributed data processing system 100 may include a network of computers in which aspects of the illustrative embodiments may be implemented. The distributed data processing system 100 contains at least one network 102, which is the medium used to provide communication links between various devices and computers connected together within distributed data processing system 100. The network 102 may include connections, such as wire, wireless communication links, or fiber optic cables.

In the depicted example, server 104 and server 106 are connected to network 102 along with storage unit 108. In addition, clients 110, 112, and 114 are also connected to network 102. These clients 110, 112, and 114 may be, for example, personal computers, network computers, or the like. In the depicted example, server 104 provides data, such as boot files, operating system images, and applications to the clients 110, 112, and 114. Clients 110, 112, and 114 are clients to server 104 in the depicted example. Distributed data processing system 100 may include additional servers, clients, and other devices not shown.

In the depicted example, distributed data processing system 100 is the Internet with network 102 representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, governmental, educational and other computer systems that route data and messages. Of course, the distributed data processing system 100 may also be implemented to include a number of different types of networks, such as for example, an intranet, a local area network (LAN), a wide area network (WAN), or the like. As stated above, FIG. 1 is intended as an example, not as an architectural limitation for different embodiments of the disclosed subject matter, and therefore, the particular elements shown in FIG. 1 should not be considered limiting with regard to the environments in which the illustrative embodiments of the present invention may be implemented.

With reference now to FIG. 2, a block diagram of an exemplary data processing system is shown in which aspects of the illustrative embodiments may be implemented. Data processing system 200 is an example of a computer, such as client 110 in FIG. 1, in which computer usable code or instructions implementing the processes for illustrative embodiments of the disclosure may be located.

With reference now to FIG. 2, a block diagram of a data processing system is shown in which illustrative embodiments may be implemented. Data processing system 200 is an example of a computer, such as server 104 or client 110 in FIG. 1, in which computer-usable program code or instructions implementing the processes may be located for the illustrative embodiments. In this illustrative example, data processing system 200 includes communications fabric 202, which provides communications between processor unit 204, memory 206, persistent storage 208, communications unit 210, input/output (I/O) unit 212, and display 214.

Processor unit 204 serves to execute instructions for software that may be loaded into memory 206. Processor unit 204 may be a set of one or more processors or may be a multi-processor core, depending on the particular implementation. Further, processor unit 204 may be implemented using one or more heterogeneous processor systems in which a main processor is present with secondary processors on a single chip. As another illustrative example, processor unit 204 may be a symmetric multi-processor (SMP) system containing multiple processors of the same type.

Memory 206 and persistent storage 208 are examples of storage devices. A storage device is any piece of hardware that is capable of storing information either on a temporary basis and/or a permanent basis. Memory 206, in these examples, may be, for example, a random access memory or any other suitable volatile or non-volatile storage device. Persistent storage 208 may take various forms depending on the particular implementation. For example, persistent storage 208 may contain one or more components or devices. For example, persistent storage 208 may be a hard drive, a flash memory, a rewritable optical disk, a rewritable magnetic tape, or some combination of the above. The media used by persistent storage 208 also may be removable. For example, a removable hard drive may be used for persistent storage 208.

Communications unit 210, in these examples, provides for communications with other data processing systems or devices. In these examples, communications unit 210 is a network interface card. Communications unit 210 may provide communications through the use of either or both physical and wireless communications links.

Input/output unit 212 allows for input and output of data with other devices that may be connected to data processing system 200. For example, input/output unit 212 may provide a connection for user input through a keyboard and mouse. Further, input/output unit 212 may send output to a printer. Display 214 provides a mechanism to display information to a user.

Instructions for the operating system and applications or programs are located on persistent storage 208. These instructions may be loaded into memory 206 for execution by processor unit 204. The processes of the different embodiments may be performed by processor unit 204 using computer implemented instructions, which may be located in a memory, such as memory 206. These instructions are referred to as program code, computer-usable program code, or computer-readable program code that may be read and executed by a processor in processor unit 204. The program code in the different embodiments may be embodied on different physical or tangible computer-readable media, such as memory 206 or persistent storage 208.

Program code 216 is located in a functional form on computer-readable media 218 that is selectively removable and may be loaded onto or transferred to data processing system 200 for execution by processor unit 204. Program code 216 and computer-readable media 218 form computer program product 220 in these examples. In one example, computer-readable media 218 may be in a tangible form, such as, for example, an optical or magnetic disc that is inserted or placed into a drive or other device that is part of persistent storage 208 for transfer onto a storage device, such as a hard drive that is part of persistent storage 208. In a tangible form, computer-readable media 218 also may take the form of a persistent storage, such as a hard drive, a thumb drive, or a flash memory that is connected to data processing system 200. The tangible form of computer-readable media 218 is also referred to as computer-recordable storage media. In some instances, computer-recordable media 218 may not be removable.

Alternatively, program code 216 may be transferred to data processing system 200 from computer-readable media 218 through a communications link to communications unit 210 and/or through a connection to input/output unit 212. The communications link and/or the connection may be physical or wireless in the illustrative examples. The computer-readable media also may take the form of non-tangible media, such as communications links or wireless transmissions containing the program code. The different components illustrated for data processing system 200 are not meant to provide architectural limitations to the manner in which different embodiments may be implemented. The different illustrative embodiments may be implemented in a data processing system including components in addition to or in place of those illustrated for data processing system 200. Other components shown in FIG. 2 can be varied from the illustrative examples shown. As one example, a storage device in data processing system 200 is any hardware apparatus that may store data. Memory 206, persistent storage 208, and computer-readable media 218 are examples of storage devices in a tangible form.

In another example, a bus system may be used to implement communications fabric 202 and may be comprised of one or more buses, such as a system bus or an input/output bus. Of course, the bus system may be implemented using any suitable type of architecture that provides for a transfer of data between different components or devices attached to the bus system. Additionally, a communications unit may include one or more devices used to transmit and receive data, such as a modem or a network adapter. Further, a memory may be, for example, memory 206 or a cache such as found in an interface and memory controller hub that may be present in communications fabric 202.

Computer program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object-oriented programming language such as Java™, Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Those of ordinary skill in the art will appreciate that the hardware in FIGS. 1-2 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash memory, equivalent non-volatile memory, or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in FIGS. 1-2. Also, the processes of the illustrative embodiments may be applied to a multiprocessor data processing system, other than the SMP system mentioned previously, without departing from the spirit and scope of the disclosed subject matter.

As will be seen, the techniques described herein may operate in conjunction within the standard client-server paradigm such as illustrated in FIG. 1 in which client machines communicate with an Internet-accessible Web-based portal executing on a set of one or more machines. End users operate Internet-connectable devices (e.g., desktop computers, notebook computers, Internet-enabled mobile devices, or the like) that are capable of accessing and interacting with the portal. Typically, each client or server machine is a data processing system such as illustrated in FIG. 2 comprising hardware and software, and these entities communicate with one another over a network, such as the Internet, an intranet, an extranet, a private network, or any other communications medium or link. A data processing system typically includes one or more processors, an operating system, one or more applications, and one or more utilities. The applications on the data processing system provide native support for Web services including, without limitation, support for HTTP, SOAP, XML, WSDL, UDDI, and WSFL, among others. Information regarding SOAP, WSDL, UDDI and WSFL is available from the World Wide Web Consortium (W3C), which is responsible for developing and maintaining these standards; further information regarding HTTP and XML is available from Internet Engineering Task Force (IETF). Familiarity with these standards is presumed.

Computing machines such as described above may provide for machine learning. As is well-known, machine learning involves using analytic models and algorithms that iteratively learn from data, thus allowing computers to find insights in the data without being explicitly programmed where to look. Machine learning may be supervised or unsupervised. Supervised machine learning involves using training examples by which the machine can learn how to perform a given task. Unsupervised machine learning, in contrast, involves providing unlabeled data objects, which the machine then processes to determine an organization of the data. One well-known type of unsupervised machine learning is clustering, which refers to the notion of assigning a set of observations into subsets, which are referred to as “clusters,” such that observations within a cluster have a degree of similarity. A common approach to clustering is k-means clustering, which is an algorithm that classifies or groups objects based on attributes or features into k number of group, typically by minimizing a sum of squares of distances between data and a centroid of a corresponding cluster. Unsupervised machine learning via clustering provides a way to classify the data. Other clustering algorithms are well-known.

Security Intelligence Platform with Incident Forensics

A representative security intelligence platform in which the techniques of this disclosure may be practiced is illustrated in FIG. 3.

Generally, the platform provides search-driven data exploration, session reconstruction, and forensics intelligence to assist security incident investigations. In pertinent part, the platform 300 comprises a set of packet capture appliances 302, an incident forensics module appliance 304, a distributed database 306, and a security intelligence console 308. The packet capture and module appliances are configured as network appliances, or they may be configured as virtual appliances. The packet capture appliances 302 are operative to capture packets off the network (using known packet capture (pcap) application programming interfaces (APIs) or other known techniques), and to provide such data (e.g., real-time log event and network flow) to the distributed database 306, where the data is stored and available for analysis by the forensics module 304 and the security intelligence console 308. A packet capture appliance operates in a session-oriented manner, capturing all packets in a flow, and indexing metadata and payloads to enable fast search-driven data exploration. The database 306 provides a forensics repository, which distributed and heterogeneous data sets comprising the information collected by the packet capture appliances. The console 308 provides a web- or cloud-accessible user interface (UI) that exposes a “Forensics” dashboard tab to facilitate an incident investigation workflow by an investigator. Using the dashboard, an investigator selects a security incident. The incident forensics module 304 retrieves all the packets (including metadata, payloads, etc.) for a selected security incident and reconstructs the session for analysis. A representative commercial product that implements an incident investigation workflow of this type is IBM® Security QRadar® Incident Forensics V7.2.3 (or higher). Using this platform, an investigator searches across the distributed and heterogeneous data sets stored in the database, and receives a unified search results list. The search results may be merged in a grid, and they can be visualized in a “digital impression” tool so that the user can explore relationships between identities.

Typically, an appliance for use in the above-described system is implemented is implemented as a network-connected, non-display device. For example, appliances built purposely for performing traditional middleware service oriented architecture (SOA) functions are prevalent across certain computer environments. SOA middleware appliances may simplify, help secure or accelerate XML and Web services deployments while extending an existing SOA infrastructure across an enterprise. The utilization of middleware-purposed hardware and a lightweight middleware stack can address the performance burden experienced by conventional software solutions. In addition, the appliance form-factor provides a secure, consumable packaging for implementing middleware SOA functions. One particular advantage that these types of devices provide is to offload processing from back-end systems. A network appliance of this type typically is a rack-mounted device. The device includes physical security that enables the appliance to serve as a secure vault for sensitive information. Typically, the appliance is manufactured, pre-loaded with software, and then deployed within or in association with an enterprise or other network operating environment; alternatively, the box may be positioned locally and then provisioned with standard or customized middleware virtual images that can be securely deployed and managed, e.g., within a private or an on premise cloud computing environment. The appliance may include hardware and firmware cryptographic support, possibly to encrypt data on hard disk.

An appliance of this type can facilitate Security Information Event Management (SIEM). For example, and as noted above, IBM® Security QRadar® SIEM is an enterprise solution that includes packet data capture appliances that may be configured as appliances of this type. Such a device is operative, for example, to capture real-time Layer 4 network flow data from which Layer 7 application payloads may then be analyzed, e.g., using deep packet inspection and other technologies. It provides situational awareness and compliance support using a combination of flow-based network knowledge, security event correlation, and asset-based vulnerability assessment. In a basic QRadar SIEM installation, the system such as shown in FIG. 4 is configured to collect event and flow data, and generate reports. A user (e.g., an SOC analyst) can then investigate offenses to determine the root cause of a network issue.

Generalizing, Security Information and Event Management (SIEM) tools provide a range of services for analyzing, managing, monitoring, and reporting on IT security events and vulnerabilities. Such services typically include collection of events regarding monitored accesses and unexpected occurrences across the data network, and analyzing them in a correlative context to determine their contribution to profiled higher-order security events. They may also include analysis of firewall configurations, network topology and connection visualization tools for viewing current and potential network traffic patterns, correlation of asset vulnerabilities with network configuration and traffic to identify active attack paths and high-risk assets, and support of policy compliance monitoring of network traffic, topology and vulnerability exposures. Some SIEM tools have the ability to build up a topology of managed network devices such as routers, firewalls, and switches based on a transformational analysis of device configurations processed through a common network information model. The result is a locational organization which can be used for simulations of security threats, operational analyses of firewall filters, and other applications. The primary device criteria, however, are entirely network- and network-configuration based. While there are a number of ways to launch a discovery capability for managed assets/systems, and while containment in the user interface is semi-automatically managed (that is, an approach through the user interface that allows for semi-automated, human-input-based placements with the topology, and its display and formatting, being data-driven based upon the discovery of both initial configurations and changes/deletions in the underlying network), nothing is provided in terms of placement analytics that produce fully-automated placement analyses and suggestions.

Advanced Persistent Threat (APT) Prevention

APT mitigation and prevention technologies are well-known. For example, IBM® Trusteer Apex® is an automated solution that prevents exploits and malware from compromising enterprise endpoints and extracting information. A solution of this type typically provides several layers of security, namely, exploit prevention, data exfiltration prevention, and credentials protection.

FIG. 4 depicts a typical embodiment, wherein the APT solution is architected generally as agent code 400 executing in enterprise endpoint 402, together with a web-based console 404 that enables IT security to manage the deployment (of both managed and unmanaged endpoints) from a central control position. The agent code 400 operates by monitoring an application state at the time the application 406 executes sensitive operations, e.g., writing a file to the file system. Generally, the agent 400 uses a whitelist of legitimate application states to verify that the sensitive operation is executed (or not) under a known, legitimate state. An exploit will attempt to execute sensitive operations under an unknown (not whitelisted) state, thus it will be stopped. The approach enables the APT agent to accurately detect and block both known and zero-day exploits, without knowing anything about the threat or the exploited vulnerability. The “agent” may be any code-based module, program, process, component, thread or the like.

FIG. 4 depicts how APT attacks typically unfold and the points at which the APT solution is operative to stop the intrusion. For example, here the attacker 408 uses a spear-phishing email 410 to send an employee a weaponized document, one that contains hidden exploit code 412. When the user opens the document with a viewer, such as Adobe Acrobat or Word, the exploit code runs and attaches to an application vulnerability to silently download malware on the employee computer 402. The employee is never aware of this download. Another option is to send a user a link 414 to a malicious site. It can be a malicious website 416 that contains an exploit code or a legitimate website that was compromised (e.g., through a watering hole attack). When the employee clicks the link and the browser renders the HTML content, the exploit code runs and latches onto a browser (or browser plug-in) vulnerability to silently download malware on the employee computer. The link can also direct the user to a phishing site (like a fake web app login page) 418 to convince the user to submit corporate credentials. After infecting the computer 402 with advanced malware or compromising corporate credentials, attacker 408 has established a foothold within the corporate network and then can advance the attack.

As depicted, the agent 400 protects the enterprise against such threats at several junctions: (1) exploit prevention 420 that prevents exploiting attempts from compromising user computers; (2) exfiltration prevention 422 that prevents malware from communicating with the attacker and sending out information if the machine is already infected with malware; and (3) credentials protection 424 that prevent users from using corporate credentials on non-approved corporate sites (including phishing or and public sites like social networks or e-commerce, for example). In one known approach, the agent performs these and related operations by monitoring the application and its operations using a whitelist of legitimate application states.

By way of additional background, information-stealing malware can be directly installed on endpoints by the user without requiring an exploit. To exfiltrate data, typically the malware must communicate with the Internet directly or through a compromised application process. Advanced malware uses a few evasion techniques to bypass detection. For example, it compromises another legitimate application process and might communicate with the attacker over legitimate websites (like Forums and Google Docs). The agent 400 is also operative to stop the execution of untrusted code that exhibits data exfiltration states. To this end, preferably it validates that only trusted programs are allowed to use data exfiltration techniques to communicate with external networks. The agent preferably uses several techniques to identify unauthorized exfiltration states and malicious communication channels, and blocks them. Because it monitors the activity on the host itself, it has good visibility and can accurately detect and block these exfiltration states.

The reference herein to the identified commercial product is not intended to be limiting, as the approach herein may be implemented with any APT solution or functionality (even if embedded in other systems).

Cognitive Cybersecurity Analytics

FIG. 5 depicts a basic operating environment that includes a cognitive cybersecurity intelligence center 500, and an endpoint 502. An endpoint 502 is a networked device that runs systems management code (software) that enables management and monitoring of the endpoint by the intelligence center 500.

The endpoint typically is a data processing system, such as described above in FIG. 2. The intelligence center 500 may be implemented as a security management platform such as depicted in FIG. 3, in association with an APT solution such as depicted in FIG. 4, or in other management solutions. Thus, for example, known commercial products and systems that provide endpoint management include IBM® BigFix®, which provides system administrators with remote control, patch management, software distribution, operating system deployment, network access protection and hardware and software inventory functionality. A commercial system of this type may be augmented to include the endpoint inter-process activity extraction and pattern matching techniques of this disclosure, or such techniques may be implemented in a product or system dedicated for this purpose.

In a typical implementation, an endpoint is a physical or virtual machine or device running an operating system such as Windows, Mac OSX, Vmware ESX, Linux, Unix, as various mobile operating systems such as Windows Phone, Symbian, iOS and Android. The cybersecurity intelligence center typically operates as a network-accessible security management platform comprising a plurality of machines and application software. Typically, the intelligence center supports cybersecurity analytics, e.g., using machine learning and the like. The intelligence center may operate in a dedicated manner to support a plurality of endpoints, or “as-a-service” on behalf of multiple enterprises each having their own endpoints. Typically, endpoint machines communicate with the intelligence center in a client-server paradigm, such as depicted in FIG. 1 and described above. The intelligence center may be located and accessed in a cloud-based operating environment.

In this approach, events, such as inter-process, events are sent from endpoints, such as endpoint 502, to a detection server executing in the intelligence center 500, where such events are analyzed. Preferably, attack detection occurs in the detection server. This approach provides for an efficient, systematic (as opposed to merely ad hoc) mechanism to record endpoint activities, e.g., via inter-process events, to describe a malicious or suspicious behavior of interest with abstractions (network graphs), and to match concrete activities (as represented in the recorded events) with abstract patterns. This matching enables the system to act upon malicious/suspicious behaviors (e.g., by halting involved processes, alerting, dropping on-going network sessions, halting on-going disk operations, and the like), as well as to assist security analysts to locate interesting activities (e.g., threat hunting) or to determine a next step that may be implemented in a workflow to address the suspect or malicious activity.

In this approach, typically both direct and indirect inter-process activities are extracted at endpoints and compared with pre-defined malicious behavior patterns for detection. Direct and indirect inter-process activities typically include control flow, such as process spawn, and information exchange via channels, such as files, sockets, messages, shared memory and the like. Inter-process activities reveal goals of processes and their particular execution paths. In the approach, they are matched against malicious inter-process behaviors for detecting attack instances. Preferably, the malicious behavior patterns are pre-defined with abstraction to characterize key steps in cyberattacks. These malicious behavior patterns typically are stored in an endpoint, and they can be updated as necessary.

FIG. 6 depicts how graphs are used to facilitate behavior-based detection/reasoning according to the above technique. In this approach, typically an individual (e.g., a software developer, a security analyst, or the like) describes a malicious or interesting behavior in an abstract graph pattern 600. In this injection, a DLL injection attack is modeled by a process 602 that executes an event (Type—create thread) 604, which then spawns another process 606. Generalizing, the graph pattern 600 comprises nodes (in this example processes 602 and 606), and edges (in this example, the event 604 that links the two nodes). In operation, a pattern matching algorithm may then return concrete activities on a host endpoint that match the pattern. The concrete activities on the endpoint preferably are also modeled by graphs to facilitate pattern matching. Two such example activity graphs 608 and 610 derived from the endpoint inter-process activity and that match the abstract graph behavior 600 are depicted. In the first example activity graph 608, process rundll.exe executing event Syscall 10 spawns process Isass.exe; in the second example activity graph 610, process Firefox.exe executing event Syscall 11 spawns process explorer.exe. This is an example of topology matching.

FIG. 7 depicts a more complex example wherein as a result of inter-process activity monitoring, the graph 700 is generated. As depicted in the legend 702, typically a graph comprises a set of entities, namely a process 704, a file 706, a network resource 708, and an event 710. Preferably, each entity in the endpoint system is associated with a label (or “tag”) that describes its category and properties, e.g., the installed Firefox (a process entity) is a “browser,” the installed Firefox is “64-bit,” and so forth. Labels may be assigned manually, e.g., “browser,” generated automatically, e.g., if it is a 64-bit executable, or computed via a function, e.g., the label “trusted” is assign if the process meet certain requirements. Labels may replace entity names to create behavior patterns for a category of processes. The graph 700 is FIG. 7 depicts and comprises a set of entities, each of which typically has an associated label (tag) that is defined in an off-line manner. Inter-process activity is monitored on the endpoint, with activities among entities being recorded, e.g., via system call monitoring, kernel hooking, system monitoring services, and so forth. Typically, a relatively constrained set of system calls or events need to be monitored to obtain the information need to construct a graph. One example (given Linux as the operating system) would be system calls that associate one entity with another, e.g., sys_open and stub_execve. A graph typically is constructed (and updated as necessary) by connecting entities and monitored activities, with an example being graph 700. Preferably, the graph is stored on disk and cached in memory.

Generalizing, the activity graph represents real-time inter-process activity extraction that occurs at the endpoint. As also depicted in FIG. 7, this extraction then facilitates behavior matching (which typically occurs in the detection server executing in the intelligence center) using one or more matching techniques. These matching techniques typically include one or more topology matching 712, label matching 714, and optionally concrete signature matching 716 As noted above, inter-process activities (and their associated labeling) as depicted in the graph reveal goals of one or more processes, as well as their particular execution paths. Matching the generated graph(s) with malicious inter-process behaviors (also defined in the form of graphs) enables the system to detect and address attack instances. As noted, preferably the malicious behavior patterns are pre-defined with some degree of abstraction to characterize key steps in a cyberattack.

More formally, an abstract pattern graph (such as graph 600 in FIG. 6) against which monitored inter-process activity is compared is sometimes referred to as a pattern graph (PG). A PG may include one or more constraints, wherein a constraint typically is a Boolean function on elements or relations of elements of the graph. Typically, there are two types of constraints, namely, single element constraints (e.g., properties/classes/concepts of a vertex/edge in a pattern graph PG), and one or more element relation constraints (i.e. how one element relates to another, e.g., direct connection, latter than, connect with “n” steps, as so forth). The monitored activities of a host (endpoint) are instantiated in a graph that is sometimes referred to herein as an activity graph (AG). In FIG. 6, graphs 608 and 610 represent an AG. A goal of pattern matching then is to search for all subgraphs of AG that satisfy PG.

FIG. 8 depicts a representative embodiment of a detection system in which the endpoint inter-process activity extraction and pattern matching technique described above may be implemented. As depicted, certain functionality is located in the intelligence center 800 (e.g., the security management platform, an APT solution, an endpoint management solution, etc.), while certain functionality is located in the endpoint 802. This arrangement of functionality is preferred, but it is not intended to be limited. As noted above, the intelligence center 800 may be dedicated to the network of endpoints (e.g., located within an enterprise), or it may operate as a service provider (or, more generally, a “service”) on behalf of multiple enterprises, each having their own set of endpoints. In a typical implementation, the cybersecurity intelligence center is network-accessible and is deployed in a cloud-based operating environment, although this is not a limitation. Further, typically each function block identified in FIG. 8 is executed in software, i.e., as a set of computer program instructions executed in a processor. The functions identified in FIG. 8 are provided for purposes of explanation only, and that certain of these functions may be combined or otherwise re-configured as necessary.

As depicted, the intelligence center 800 performs several functions, namely, label generation 804 (step 1), and malicious behavior discovery and encoding 806 (step (4)). As depicted, typically these activities are informed by and based on existing attack information available in the intelligence center, e.g., threat reports 808, expert knowledge 810 and information derived from sandboxing and evaluating threats 812. This set of information typically is available to or otherwise obtained by security analysts. As described above with respect to FIG. 7, in label generation 804, each entity in the endpoint system is associated with one or more labels that describe its category and properties. The labels are applied manually, automatically, programmatically, etc., or by some combination. The label generation 804 may be carried out periodically, or upon a given occurrence. The malicious behavior discovery and encoding 806 derives malicious (or otherwise suspect) graph patterns from existing attacks. As noted, typically these patterns are determined by human analysts, other security detection mechanisms, machine learning systems, or combinations thereof. As also depicted, a set of malicious patterns generated from the knowledgebase of attack source (808, 810, 812) is stored in a malicious pattern database 814.

Function block 816 (step 2) represents inter-process activity extraction, which typically involves monitoring 818 (step 2.1), and labeling 820 (step 2.2). The monitoring function records activities among entities, e.g. via system call monitoring, kernel hooking, system monitoring services and the like. Thus, the monitoring function 818 may leverage existing endpoint service functionality. As noted, it is not required that the monitoring 818 monitor all system calls or events, and the calls and events to be monitored is configurable as needed. Step 2.2, the labeling function, takes a behavior signature created by the labeling function (step 1) and builds an abstract/labelled behavior signature. This abstraction is desirable, as the abstract/labelled behavior signature expresses attack logic in a more general manner and thus covers one or more attack variants for a specific attack, and it enables the efficient matching of labels or concrete vertices/edges during subsequent matching operations (described below).

Function block 822 (step 3) provides activity graph construction. This processing typically involves ingesting 824 (step 3.1), which extends the graph as new activities occur and are monitored, and aging 826 (step 3.2), whereby vertices/edges of the graph are dropped (pruned) if they are older than a configurable threshold, or if their distance(s) to a newly-extended graph are larger than a configurable threshold. The inter-process activity graph generated by these activity graph construction function 822 is stored in a database 828. Typically, the inter-process activity graph evolves as the monitoring, ingesting and aging functions operate, preferably on a continuous basis.

As also depicted, the endpoint supports an attack subgraph matching function 830 (step 5). Using this function, the endpoint protection system continuously performs graph pattern matching between the evolving inter-process activity graph, and the malicious behavior graph patterns. These patterns are provided by the malicious pattern database 814 in the intelligence center 800 and stored in a local malicious pattern cache 832. As described above, the attack subgraph matching function searches for graph substructure that matches the malicious behavior graph pattern(s) stored in the local cache 832. Thus, in this approach, the endpoint detection system functionality compares the evolving activity graph with the malicious inter-process graph patterns. Based on this matching, a mitigation and resilience function 834 (step 6) may then be called. Function 834 comprises a report function 836 (step 6.1), and a react function 838 (step 6.2). The function 834 thus provides for post-detection operations, which typically comprises halting the involved processes, alerting, moving the involved processes to a sandbox for further evaluation, dropping on-going network sessions, halting on-going disk operations, handing off the matched subgraph to a user to decide a next step, submitting the matched subgraph to a security analyst for further study, training a machine learning classifier, and so forth. These are merely representative post-detection operations.

As also depicted in FIG. 8, the mitigation and resilience function 834 typically interacts with the intelligence center 800 in an on-demand manner, whereas information flow within the endpoint functions typically is continuous. One or more functions in the endpoint may be carried out on periodically, in response to an occurrence, or on-demand.

The above-described technique and system provides for a robust method to monitor and protect and endpoint by recording inter-process events, creating an inter-process activity graph based on the recorded inter-process events, matching the inter-process activity (as represented in the activity graph) against known malicious or suspicious behavior (as embodied in a set of pattern graphs), and performing a post-detection operation in response to a match between an inter-process activity and a known malicious or suspicious behavior pattern. Preferably, matching involves matching a subgraph in the activity graph with a known malicious or suspicious behavior pattern as represented in the pattern graph. During this processing, preferably both direct and indirect inter-process activities at the endpoint (or across a set of endpoints) are compared to the known behavior patterns.

FIG. 9 is a block diagram of a representative architecture of a graph computation platform 900. This platform may be implemented in the intelligence center depicted in FIG. 8, in the security intelligence platform in FIG. 3, in the APT solution in FIG. 4, as a standalone functionality or application, as a network- or cloud-accessible service, or otherwise. As depicted, the platform 900 comprises a language interpreter 902, a graph database 904, and user-interface components 906. The user-interface components 906 comprise an interactive console 908, and a connection graph visualization tool (a browser) 910. The user-interface components provide an interactive programming and data inspection environment for threat reasoning. The graph database 904 preferably comprises a graph query interface 912, an in-memory graph cache 924, an element cache 926, a label cache 928, one or more graph construction routines 930, an on-disk element query function 932, a key-value store translation table 934, and a distributed Feature Collection and Correlation Engine (FCCE) client 936. The FCCE client 936 interfaces across the network to one or more FCCE data nodes 938, which nodes store the graphs typically in a distributed manner. Preferably, the graph database 904 employs a distributed key-value store over the FCCE data nodes 938 for long-term monitoring data storage with data locality optimization, and concurrent multi-source streaming data ingestion. The interpreter 902 comprises a number of functional elements include a code generation module 939 that works with a constraint solver 930, other built-in algorithms 932, and a Universal Disk Format (UDF) linker 933. Interpreter 902 also includes a lexer/parser 934, a type checking and inference module 936, and an AST optimizer 938. The user interface also includes a batch processor 940.

The graph database 904 stores both in-memory and on-disk pattern graph portions, and it provides graph query APIs (912) to the interpreter 902. The main functions of the graph database are to bridge the semantics of the pattern graph and low-level data storage, and to optimize graph retrieval throughput, preferably using multi-layer caches (914, 916, 918) and data arrangement based on PG properties, such as temporal locality of events. As noted above, one such graph database solution that provides these features is FCCE. In particular, FCCE supports concurrent low latency multi-source asynchronous ingestion, distributed data storage, and data locality management. To optimize graph queries based on pattern graph properties, an FCCE schema is used. This schema represents the pattern graph in key-value pairs, and certain values preferably are replicated in one or more schemas for data locality preservation and fast retrieval from different perspectives. Thus, for example, one replica of events may deal with temporal locality, wherein events are indexed by time, and events occurring within a time window are managed on one memory page and stored at consecutive filesystem blocks. Other event replicas may deal with labels and shared entities.

To process a graph query, the graph database first checks whether any portion of the data is already loaded into memory through previous queries. If not, the database preferably splits the graph query into one or more on-disk element queries, each of which is to be translated into key-value queries that the graph database (e.g., FCCE) can process. Labels are expressed as dictionary items to express complex element attributes. In an example operation, a simple element query searching for file entities whose path contains a substring firefox translates into two graph database queries: the first searches for all satisfied labels, and the second searches for raw data to construct elements associated with these labels. When raw data is retrieved from disk, preferably buckets of key-value pairs are first cached in a graph database client where data within a bucket preferably has tight data locality and high probability to be queried in the same high-level graph query or following queries. Then, different components of an element are constructed and some are cached for frequent referencing, e.g., the principal label for processes containing multiple pieces of information including the username, uid, group, etc., and it is cached as a reference. Next, elements are constructed and cached. Lastly, the requested graph is assembled and returned.

As will be described below, and according to this disclosure a pattern graph (PG) (such as graph 600 in FIG. 6) is specified visually (i.e., by drawing a graph). A pattern graph (or graph pattern) also may be specified in other ways, e.g., by a program language.

The following provides additional details regarding the activity graph (AG) construct as described above. The activity graph typically expresses computations on one or more computing devices (which may include the endpoint) as a temporal graph. As such, the activity graph is also sometimes referred to herein as a computation graph (CG), as it represents an abstraction of the computations. The notion of an “activity graph” and a “connection graph” are used synonymously. As previously described, the basic elements of a AG/CG are entities (e.g., processes, files, network sockets, registry keys, GPS sensor, accelerometer, etc.), and events (e.g., file read, process fork, etc.). An entity is any system element that can either send or receive information. An event is any information/control flow that connects two or more entities. Events typically are information flows between pair of entities at specific times. Events can be captured in the form of system calls, etc. An event has a unique timestamp (when it happens), and an information flow direction (directional, bi-directional, non-directional). An indegree entity of an event can be one or two entities of the event based on its direction. An outdegree entity of an event can be one or two entities of the event based on its direction. A timestamp is an integer or real number that records the time of an event, and a joinpoint (or checkpoint) is a tuple of <entity, timestamp>. Thus, an AG/CG references a history of computation including any entities or events associated with attacks or threats. Security-related data, such as alerts, IOCs, and intermediate threat analysis results are subgraphs, which can be denoted as labels on elements of a AG/CG, where typically an element is an alias referencing an entity or an event. As a result, threat detection is a graph computation problem whose solution it to iteratively deduce threat-inducing subgraphs in a AG/CG.

More generally, an activity graph is a labeled semi-directed temporal graph that objectively records both intrusive and non-intrusive computations on computing devices, together with any security knowledge associated with the computations. A particular label on the graph typically denotes one of several categories, e.g. the labels: element attribute, element relation, and security knowledge. An element attribute label is objective information derived from computation recording (as has been described above); this type of label identifies a set of elements with a particular attribute, e.g., an event type READ. An element relation label is objective information derived from computation recording; this type of label expresses some relation among a set of elements, e.g., a provenance linkage between READ and WRITE events of a process, which connects a large number of READ/WRITE events. This label embeds finer-grained provenance information into an inter-process level PG. A security knowledge label (when used) is subjective information regarding the security and privacy goals and reasoning procedures; a label of this type marks a group of elements with some security knowledge. A security knowledge label can be generated as either intermediate/final results of threat deduction, or organization policies, IOCs, or anomaly scores imported from external detection systems, e.g., a set of confidential files, or IP addresses marked as command and control servers.

Enterprises and organizations typically inspect computations at multiple levels for threat discovery. An AG/CG typically describes computations at a selected monitoring level, such as network, host or process level. Given a monitoring level, e.g., network, the activities within an entity, e.g., process communications within a host, are usually out of the monitoring scope and not expressed in the CG. Finer-grained computation information typically is either expressed in a lower-level CG, e.g., a CG at the host level, or embedded into the CG as labels, e.g., provenance labels.

Interactive Display System Graph Pattern Editor

With the above as background, the graph pattern editor of this disclosure is now described. The editor enables a user to encode his or her human knowledge into a graph pattern, and to have the pattern automatically transformed into a reusable text representation, typically program code that encodes the visualized graph pattern. In one embodiment, the editor is implemented as part of the interactive console 908 in the graph computation platform 900. This is not a limitation. The interactive display system may be implemented in any computing system, e.g., the data processing system depicted in FIG. 2 and described above.

FIG. 10 depicts a simplified block diagram of a set of components or modules that comprise the interactive display system 1000 of this disclosure, according to one embodiment. System 1000 in particular comprises a canvas 1002, a layout engine 1004, a serialization module 1006, a deserialization module 1008, and a bookkeeping module 1010. The canvas 1002 implements a two-dimensional (2D) interactive display interface (e.g., a capacitive touch screen) that receives user inputs, e.g., from a rubber-tipped capacitive stylus, and that depicts the graph pattern as it is composed by the user. As will be described in more detail below, the canvas 1002 provides a visual palette that depicts a 2D temporal layout that preferably is configured with time depicted on the x-axis, and space depicted on the y-axis. These orientations may be reversed. Using an input tool (or his or her finger), a user draws lines on the canvas, e.g., where a horizontal line represents an entity that exists through time, and a vertical line represents events that connect entities. These orientations and what they specify may of course vary. In addition, a user draws one or more boxes, e.g., that may represent a subgraph, or a set of entities and events. By drawing curving or dotted lines connecting entities/boxes to induce indirect links between them, the user thereby depicts other relationships, e.g., a multi-hop connection. Using the input tool, the user can also add labels on any entity, event or box, edit attributes thereof, or mark it as a result from another pattern matched. The layout engine 1004 is configured to arranges the positions of events according to their time. The serialization module 1006 is configured to provide a translation function. In particular, and preferably as the user composes and/or edits the graph, the serialization module 1006 serializes the specified graph pattern into a text-based representation, typically program code 1012. The program code 1012 representing the pattern graph designed by the user is then stored to disk, e.g., graph database 904 (in FIG. 9). More generally, the program code representing the pattern graph is stored in a graph library that includes other such pattern graphs that have been created by one or more other system users, or from other sources. The deserialization module 1008 acts in reverse (to the serialization module 1006; module 1008 thus is used to retrieve program code 1012 (from disk (or other storage), and to de-serialize the retrieved program code back into a form in which it is displayable on the canvas 1002. Finally, the bookkeeping module 1010, which acts as a database, is used to keep track of variables that reference elements rendered on the display, as well as variables that represent arguments of the composed pattern. A pattern being composed may refer to other existing patterns, and the bookkeeping module 1010 enables an argument in the pattern being composed to refer to one or more other patterns.

Generalizing, the canvas provides a graphical user interface having a 2D temporal layout onto which a computation graph is designed and visualized. As the pattern is designed and drawn, the other modules generate program code that is then used to facilitate a graph matching operation.

Thus, the above-described system provides a simple-to-use interactive editor and that allows the user to draw graph patterns for temporal graphs on the display screen and to output program code. The following describes how the editor may be used in this manner.

FIG. 11 depicts the basic process for graph pattern composition using the editor. As depicted, preferably composition proceeds as a multi-layer stack. The bottom layer 1100 is the canvas, which provides for the 2D temporal graph pattern layout (time on the x-axis, space on the y-axis). The canvas determines the scope and granularity of the analytics. An entity layer 1102, and an event layer 1104, are created from logs and traces. A label layer 1106 expresses knowledge about the entities/events, as well as security domain knowledge, such as alerts and analytical results. The resulting graph pattern 1108 depicts the composed structure.

FIG. 12 depicts an example graph pattern 1200 that is composed using the editor for a host file system 1202. In this example, system activities are logged, e.g., via syscall monitoring and program instrumentation. Entities (en) in this graph consist of subjects (e.g., processes and threads) and objects (e.g., files, pipes, and network sockets). In this example, security data is embedded in labels: lb₁: sensitive indicates that en_(f2) contains sensitive information, and lb₂: untrusted indicates that en_(p3) is not certified by the company. In this example, data leakage occurs when en_(p3) can be traversed from en_(f2), as shown in FIG. 12.

As another example, FIG. 13 depicts a representative graph pattern composed at a network level using the editor. In this example, the metadata of link layer communications of a small network is logged for threat intelligence computing. As depicted, lb₁ is a provenance label linking four events among entities en_(σ2), en_(σ3) and en_(σ4). The link lb₁ helps identify the causal chain between en_(σ3) and en_(σ4) avoiding impossible paths. Attack steps such as port scans and cross-host lateral movements can be identified and reasoned on this connection graph.

As still a further example, FIG. 14 depicts a graph pattern composed at a process level using the editor. In this example, activities with a process are monitored, e.g., via dynamic program analysis. In this graph, entities are memory addresses of code and data; events are instructions (e.g., call) or syscalls (nmap). The infinity of Θ (the space of entities that can be monitored or traced) supports the representation of recursive calls, e.g., instances of foo( ) are described as en_(foo), en′_(foo), . . . . Software exploit activities such as return-to-libc and return-oriented programming (ROP) can be captured and inspected on this connection graph.

The following describes basic user interactivity with the editor. Preferably, the interactivity includes a relationship succinct set of elements, such that the interaction/drawing applies to lines, boxes, curved lines, and labels (attributes and argument variables). This enables the user to encode the human knowledge is an intuitive manner. As noted above, preferably the user draws the elements using an input tool. To this end, FIG. 15 depicts a simple line entered by the user, and this line represents a single-entity pattern with entity attributes as specified. FIG. 16 depicts a slightly more complex interaction, in this example a specific browser process and the processes/files connecting to it. FIG. 17 depicts how a user may describe a multi-hop relationship. In this example, and as depicted on the left side, the user's human knowledge (and the associated events and entities) indicates that all possible information/control flow sources are within four (4) hops. With that knowledge in mind, the user depicts the pattern as shown on the right side, with the process and socket each depicted as a line (and configured temporally), and with the flow sources depicted as a subgraph box and connected to the process via a curved line. FIG. 17 depicts how the x-axis automatically places time as an attribute to events, thereby making it easy for the user to express the temporal relation between the depicted process and socket events. FIG. 18 depicts another example interface description, wherein one or more pattern arguments are input, e.g., via an input argument box. These examples depict how the user can encode his or her knowledge in association with the information sourced from the underlying system to generate a pattern graph.

Using the editor in this manner, the user composes graph patterns. A graph pattern with two entities connected by an event and that includes specified attributes can easily answer the question of what network activity a specific process has. A graph pattern may be composed describing a suspicious behavior, e.g., a DLL injection, a port scan, or the like. In a more complex example, a user can write a backtracking pattern with a traversal constraint as a separate pattern, which then behaves like a call-back function and is specified at runtime as an argument of the backtracking pattern. In general, the pattern design interface enables the user to codify knowledge into graph patterns that are then used to conduct higher-order reasoning.

The technique described above provides several advantages. The graph pattern editor provides a simple and intuitive interface by which a user draws a graph pattern, which is then used for the graph matching. The editor provides an intuitive operation and thus is simple to use, even for non-programmers. In particular, and as has been described, preferably the editor facilitates a 2D graph pattern layout based on computation graph visualization, wherein the x-axis represents time, and the y-axis represents space. This layout automatically places time as an attribute to each event, and the layout makes it simple for the user to express a temporal relation between or among events. Further, the temporal graphing enabled by the editor provides for entities to be split into line segments based on time, which eliminates any otherwise ambiguous status change of an entity. Further, by limiting interactions and drawings to simple lines, boxes, curved lines and labels (e.g., attributes and argument variables), a graph pattern is easy to define.

The grid-like pattern structure implemented by the editor enables the user to visually encode temporal information in the pattern. The editor provides an easy-to-use and intuitive interface by which human knowledge on a threat is received and readily encoded to generate a graph pattern. Graph patterns created in the manner comprise a pattern library, and patterns so composed are reusable. In this manner, the editor enables the human knowledge on threats to be converted into the structured knowledge in the graph pattern library. The editor facilitates temporal pattern encoding but without requiring the user to be a programmer or have other specialized knowledge for generating the structured knowledge.

More generally, the disclosure provides an interactive method to encode human knowledge and generate patterns into a graph pattern library. In the prior art, the encoding of human knowledge into graph patterns required the user to have training, e.g., in how to write patterns via a computer language. The interactive system herein is much more user-friendly and much more efficient than prior methods. Further, by serializing the graphical pattern drawn by the user into a text-based representation (in the manner described above), the structured knowledge encoded into that representation is easily stored, retrieved, and reused.

In particular, given an activity/connection (pattern) graph that records objective computation histories regarding both intrusive and non-intrusive data, in a representative use case threat discovery then reduces to a graph query problem of iteratively computing the closure over the subset of security related subgraphs in the AG/CG, and finally yielding a subgraph that describes the threat or intrusion. Graph queries can be programmed into IDSes or behavior anomaly detection systems, or they can be accomplished through on-demand agile reasoning development. Threat hunting composes sequences of graph queries to iteratively and interactively conceive, verify, revise and confirm threat hypotheses.

The process of composing and executing graph queries in the activity/connection graph is graph computation. During the computation, any variable referencing a subgraph is also a label to the set of entities and events of that subgraph, and the variable can be stored as a label on the AG/CG. Because the outcome of each iterative graph computation step is a subgraph or a label, each step can be implemented natively in a graph computation language or in an external module as a black-box, which outputs a set of events and entities as the subgraph. Threat intelligence therefore is generated in the graph query when a threat is discovered. The query, especially the graph pattern, describes the threat and can be executed to search other activity/connection graphs for the specific threat.

Graph pattern matching is at the core of graph querying. Generalizing, a graph pattern, in essence, is a set of constraints describing the subgraph(s) to be matched, where a constraint over graph elements describes (1) a single graph element (e.g., a label/property of an entity), or (2) an element relation (e.g., an entity connects to an event). As has been described, graph pattern composition allows for embedding human domain knowledge into the deduction procedure. Simple pattern examples, which can be expressed visually using the editor include: behavior of typical DLL injections (e.g., two entities with PROCESS labels are connected by an event with label CREATE_THREAD), behavior of untrusted executions (e.g., an entity with FILE label but not a TRUSTED_EXE label connects to an event labeled EXECUTE, then to an entity labeled PROCESS), and behavior of data leak (e.g., an entity labeled with SENSITIVE connects to an entity labeled NETFLOW within a given number of hops). These are representative but non-limiting examples that can be specified using the editor and then transformed seamlessly into the program code.

Summarizing, in the approach described above threat discovery is transformed into a graph computation problem. In that approach, security logs, traces, and alerts are stored in a temporal graph or computation graph (CG). The CG records the history of monitored systems, including benign activities and malicious ones, as interconnected entities and events. Threat discovery then becomes a graph computation problem to identify a subgraph of CG that describes a threat or an attack, preferably with the help of alerts and security domain knowledge stored as element labels.

The technique may be implemented in a behavior-based malware detection system that operates in association with a monitored computing system or network. The computing system being monitored may be implemented as described above with respect to FIG. 2, and it is assumed to comprise executing a set of (runtime) processes. System events, e.g., system calls and API calls of each process, are continuously monitored and recorded. The particular manner in which the system events are monitored, identified and stored is not an aspect of this disclosure. In a typical implementation, system activities of this type are logged, e.g., by the operating system, or by via syscall monitoring and program instrumentation. The malware detection system is configured to execute in any of the operating system environments described above, e.g., FIG. 3, FIG. 4 or FIG. 5. One of more components of the malware detection system may execute in a cloud-based architecture. In a variant implementation, the malware detection system executes natively in the computing system whose system events are being monitored.

Typically, each such module (such as those depicted in FIG. 10) is implemented in software, namely, as a set of computer program instructions, executed in one or more hardware processors. These modules may be integrated with one another, co-located or distributed, or otherwise implemented in one or more computing entities. One or more of these functions may be implemented in the cloud.

The system event semantic model may be used to facilitate malware detection for computing systems other than the computing system(s) whose system events were recorded and used to facilitate the model building.

The approach herein is designed to be implemented in an automated manner within or in association with a security system, such as a SEIM device or system in FIG. 3, an APT platform as depicted in FIG. 4, a cloud-based cybersecurity analytics system in FIG. 5, or some other execution environment wherein system events are captured and available for mining and examination. The particular operating platform or computing environment in which the event modeler technique is implemented, however, is not a limitation. The machine learning itself can be provided “as-a-service” using a machine learning platform or service.

Alternatively, the functionality described above may be implemented as a standalone approach, e.g., a software-based function executed by a processor, or it may be available as a managed service (including as a web service via a SOAP/XML interface). The particular hardware and software implementation details described herein are merely for illustrative purposes are not meant to limit the scope of the described subject matter.

More generally, computing devices within the context of the disclosed subject matter are each a data processing system (such as shown in FIG. 2) comprising hardware and software, and these entities communicate with one another over a network, such as the Internet, an intranet, an extranet, a private network, or any other communications medium or link. The applications on the data processing system provide native support for Web and other known services and protocols including, without limitation, support for HTTP, FTP, SMTP, SOAP, XML, WSDL, UDDI, and WSFL, among others. Information regarding SOAP, WSDL, UDDI and WSFL is available from the World Wide Web Consortium (W3C), which is responsible for developing and maintaining these standards; further information regarding HTTP, FTP, SMTP and XML is available from Internet Engineering Task Force (IETF). Familiarity with these known standards and protocols is presumed.

The scheme described herein may be implemented in or in conjunction with various server-side architectures including simple n-tier architectures, web portals, federated systems, and the like. The techniques herein may be practiced in a loosely-coupled server (including a “cloud”-based) environment.

Still more generally, the subject matter described herein can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the function is implemented in software, which includes but is not limited to firmware, resident software, microcode, and the like. Furthermore, as noted above, the functionality described can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain or store the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or a semiconductor system (or apparatus or device). Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk-read only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD. The computer-readable medium is a tangible item.

The computer program product may be a product having program instructions (or program code) to implement one or more of the described functions. Those instructions or code may be stored in a computer readable storage medium in a data processing system after being downloaded over a network from a remote data processing system. Or, those instructions or code may be stored in a computer readable storage medium in a server data processing system and adapted to be downloaded over a network to a remote data processing system for use in a computer readable storage medium within the remote system.

In a representative embodiment, the machine learning-based techniques are implemented in a special purpose computer, preferably in software executed by one or more processors. The software is maintained in one or more data stores or memories associated with the one or more processors, and the software may be implemented as one or more computer programs. Collectively, this special-purpose hardware and software comprises the functionality described above.

While the above describes a particular order of operations performed by certain embodiments of the invention, it should be understood that such order is exemplary, as alternative embodiments may perform the operations in a different order, combine certain operations, overlap certain operations, or the like. References in the specification to a given embodiment indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic.

Finally, while given components of the system have been described separately, one of ordinary skill will appreciate that some of the functions may be combined or shared in given instructions, program sequences, code portions, and the like.

The techniques herein provide for improvements to another technology or technical field, among others: endpoint management systems, APT solutions, security incident and event management (SIEM) systems, as well as improvements to knowledge graph-based cyber-analytics, including threat hunting. Cyber threat hunting is the process of proactively and iteratively formulating and validating threat hypotheses based on security-relevant observations and domain knowledge. The approach herein facilitates such activities by modeling threat discovery as a graph computation problem. Indeed, given a process graph that is specified visually (using the editor) and records objective computation histories regarding both intrusive and non-intrusive data, threat discovery reduces to the graph query problem of iteratively computing a closure over a subset of security-related subgraphs in the process graph, and then finally yielding the subgraph that describes the threat of intrusion. Graph queries can be pre-programmed into intrusion detection systems or behavior anomaly detection systems, or the like. Threat hunting composes sequences of graph queries to iteratively and interactively conceive, verify, revise and confirm threat hypotheses. 

Having described the subject matter above, what we claim is as follows:
 1. A method for network threat analysis, comprising: providing a display interface with a two-dimensional (2D) grid, wherein a first axis of the grid represents time, and a second axis of the grid represents space; responsive to user inputs received on the display interface, the user inputs specifying one or more entities, one or more events associated with the one or more entities, and attributes associated to the entities and events, recording a graph pattern; automatically processing the graph pattern into a text-based representation; and performing a threat discovery operation using the text-based representation, wherein performing the threat discovery operation includes: iteratively computing a closure over a set of subgraphs in the graph pattern; and identifying a subgraph of the set that describes a security threat.
 2. The method as described in claim 1 wherein the processing serializes the graph pattern into program code.
 3. The method as described in claim 1 further including saving the text-based representation for reuse.
 4. The method as described in claim 3 further including: retrieving the text-based representation; de-serializing the retrieved text-based representation to re-generate the graph pattern; and providing the re-generated graph pattern for rendering on the display interface.
 5. The method as described in claim 1 wherein a user input is one of: a straight line that represents an entity, a straight line with one or more interconnections that represent a set of events related to an entity, a box that represents a set of entities and events, a curved line that represents a multi-step connection among entities and events, and a label that represents an attribute or argument variable.
 6. The method as described in claim 1 further including incorporating into the graph pattern one or more other graph patterns.
 7. An apparatus, comprising: a processor; computer memory holding computer program instructions executed by the processor, the computer program instructions configured to perform network threat analysis, the computer program instructions comprising program code configured to: provide a display interface with a two-dimensional (2D) grid, wherein a first axis of the grid represents time, and a second axis of the grid represents space; responsive to one or more user inputs received on the display interface, the user inputs specifying one or more entities, one or more events associated with the one or more entities, and attributes associated to the entities and events, record a graph pattern; automatically process the graph pattern into a text-based representation; and perform a threat discovery operation using the text-based representation, wherein the program code configured to perform the threat discovery operation includes program code configured to: iteratively compute a closure over a set of subgraphs in the graph pattern; and identify a subgraph of the set that describes a security threat.
 8. The apparatus as described in claim 7 wherein the program code to process the graph pattern further includes program code configured to serialize the graph pattern into program code.
 9. The apparatus as described in claim 7 wherein the program code is further configured to save the text-based representation for reuse.
 10. The apparatus as described in claim 9 wherein the program code is further configured to: retrieve the text-based representation; de-serialize the retrieved text-based representation to re-generate the graph pattern; and provide the re-generated graph pattern for rendering on the display interface.
 11. The apparatus as described in claim 7 wherein a user input is one of: a straight line that represents an entity, a straight line with one or more interconnections that represent a set of events related to an entity, a box that represents a set of entities and events, a curved line that represents a multi-step connection among entities and events, and a label that represents an attribute or argument variable.
 12. The apparatus as described in claim 7 further including program code configured to incorporate into the graph pattern one or more other graph patterns.
 13. A computer program product in a non-transitory computer readable medium for use in a data processing system, the computer program product holding computer program instructions that, when executed by the data processing system, are configured to perform network threat analysis, the computer program instructions comprising program code configured to: provide a display interface with a two-dimensional (2D) grid, wherein a first axis of the grid represents time, and a second axis of the grid represents space; responsive to one or more user inputs received on the display interface, the user inputs specifying one or more entities, one or more events associated with the one or more entities, and attributes associated to the entities and events, record a graph pattern; automatically process the graph pattern into a text-based representation; and perform a threat discovery operation using the text-based representation, wherein the program code configured to perform the threat discovery operation includes program code configured to: iteratively compute a closure over a set of subgraphs in the graph pattern; and identify a subgraph of the set that describes a security threat.
 14. The computer program product as described in claim 13 wherein the program code to process the graph pattern further includes program code configured to serialize the graph pattern into program code.
 15. The computer program product as described in claim 13 wherein the program code is further configured to save the text-based representation for reuse.
 16. The computer program product as described in claim 15 wherein the program code is further configured to: retrieve the text-based representation; de-serialize the retrieved text-based representation to re-generate the graph pattern; and provide the re-generated graph pattern for rendering on the display interface.
 17. The computer program product as described in claim 13 wherein a user input is one of: a straight line that represents an entity, a straight line with one or more interconnections that represent a set of events related to an entity, a box that represents a set of entities and events, a curved line that represents a multi-step connection among entities and events, and a label that represents an attribute or argument variable.
 18. The computer program product as described in claim 13 further including program code configured to incorporate into the graph pattern one or more other graph patterns. 